Constant-to-one extensions of shifts of finite type

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

extensions of some polynomial inequalities to the polar derivative

توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی

15 صفحه اول

Finite Group Extensions of Shifts of Finite Type: K-theory, Parry and Livšic

This paper extends and applies algebraic invariants and constructions for mixing finite group extensions of shifts of finite type. For a finite abelian group G, Parry showed how to define a G-extension SA from a square matrix over Z+G, and classified the extensions up to topological conjugacy by the strong shift equivalence class of A over Z+G. Parry asked in this case if the dynamical zeta fun...

متن کامل

Tree-shifts of finite type

A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state automaton. While the conjugacy of shifts of finite type is decidable for one-sided shifts of finite type of dimension one, the result is unknown in the two-sided case. In this paper, we study the shifts of finite type de...

متن کامل

One-point extensions of finite inversive planes

A one-point extension of an egglike inversive plane of order n exists if, and only if, n is 2 or 3. Hence there are no 4-(18,6,1) designs and no 4-(66,10,1) designs. An inversive plane of order n is a one-point extension of an affine plane of ordern, that is, a 3-(n + 1,n + 1,1) design. An ovoid of PG(3, q), q > 2, is a set of q2 + 1 points, no three collinear. An ovoid of PG(3, 2) is a set of ...

متن کامل

Combinations of Context-Free Shifts and Shifts of Finite Type

A Dyck shift and a Motzkin shift are mathematical models for constraints on genetic sequences. In terms of the theory of symbolic dynamics, neither of the Dyck shift nor the Motzkin shift is sofic. In terms of the mathematical language theory, they are non-regular and context free languages. Therefore we can not use the Perron-Frobenius theory to calculate capacities of these constraints. O. Mi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1996

ISSN: 0002-9939,1088-6826

DOI: 10.1090/s0002-9939-96-03341-2